Covering segments with unit squares
نویسندگان
چکیده
منابع مشابه
Covering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملCovering Points by Isothetic Unit Squares
Given a set P of n points in R, we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersecting (having empty common zone) such that they together cover maximum number of points. The time and space complexities of the proposed algorithm for this problem are both O(n). We also study the problem of computing k di...
متن کاملMaximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of points of P . In case of overlapping, the points in their common zone are counted once. To solve the problem, we propose an algorithm that runs in O(n log n) time using O(n log n) space.
متن کاملCovering Salesman Problem with Nodes and Segments
In the Covering Salesman Problem (CSP), a distribution of nodes is provided, and the objective is to identify the shortest-length tour of a subset of all given nodes such that each node is not on the tour which is within a radius r of any node on the tour. In this paper, we define a new covering problem called the CSP with Nodes and Segments (CSPNS). The main difference between the CSP and the ...
متن کاملCovering by squares
In this paper we introduce the “do not touch” condition for squares in the discrete plane. We say that two squares “do not touch” if they do not share any vertex or any segment of an edge. Using this condition we define a covering of the discrete plane, the covering can be strong or weak, regular or non-regular. For simplicity, in this article, we will restrict our attention to regular covering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2019
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.01.001